Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
نویسندگان
چکیده
منابع مشابه
Alternative Formulations and Improved Bounds for the Multi-Depot Fleet Size and Mix Vehicle Routing
In this paper we model and solve the multi-depot fleet size and mix vehicle routing problem (MDFSMVRP). This problem extends the multi-depot vehicle routing problem and the fleet size and mix vehicle routing problem, two logistics problems that have been extensively studied for many decades. This difficult transportation problem combines complex assignment and routing decisions under the object...
متن کاملThree New Heuristic Algorithms For The Fleet Size And Mix Green Vehicle Routing Problem
In recent years, great efforts have been made to reduce greenhouse gas emissions by vehicles. Petroleum products produces greenhouse gas emissions, therefore reducing the use of these products can make a major contribution to reducing pollution. The Fleet Size and Mix Vehicle Routing Problem is one of the most widely used routing branches. In this problem, there are vehicle with different capac...
متن کاملThe fleet size and mix vehicle routing problem
In this paper we present a new variant of the classical Vehicle Routing Problem – the Fleet Size and Mix Vehicle Routing Problem with Backhauls (FSMVRPB). An ILP formulation of the FSMVRPB is presented. Optimal solutions for small size instances are produced and upper and lower bounds are generated for larger ones. In this paper we also propose a Set Partitioning Problem (SPP) based heuristic. ...
متن کاملA Novel Constructive Routing Algorithm for Fleet Size and Mix Vehicle Routing Problem
Ruiz-Vanoye et al. show a practice case of strategic planning for the computer science security based on the concepts of strategic administration of enterprise politics. The practice case of the computer science security shows information about an Electric Research Institute of Mexican Government. The Electric Research Institute is a public enterprise dedicated to innovation, technological deve...
متن کاملThe fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm
This paper introduces the fleet size and mix location-routing problem with time windows (FSMLRPTW) which extends the location-routing problem by considering a heterogeneous fleet and time windows. The main objective is to minimize the sum of vehicle fixed cost, depot cost and routing cost. We present mixed integer programming formulations, a family of valid inequalities and we develop a powerfu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: OR Spectrum
سال: 2017
ISSN: 0171-6468,1436-6304
DOI: 10.1007/s00291-017-0494-y